Transformation of Reduction Systems a View on Proving Correctness Transformation of Reduction Systems a View on Proving Correctness

نویسندگان

  • Bas Luttik
  • Jan Bergstra
چکیده

was centered around two questions: 1. What are good notions for proving correctness of transformations for Reduction Systems? 2. Does Thatte's transformation preserve connuence for the class of weakly persistent systems? Jan Bergstra helped me with the rst question and was my supervisor in the rst part of the project. We had long talks about computer science, university, and other things. Those talks were extremely instructive. At a particular moment, Jan led me into the room of Piet Rodenburg. Piet would become my supervisor for the second part of the project. He literally taught me how read and write mathematics and meticulously read various drafts of this thesis. Moreover, he xed my attention on the second question and provided the counterexample to a claim in Verma's proof. We spent a lot of time searching for proofs and counterexamples of Verma's theorem, but did not nd the answer yet. Nonetheless, I still haven't lost hope that we will eventually solve the problem and I hope Piet hasn't either. Thank you Jan and Piet. I would also like to thank Wan Fokkink, Jasper Kamperman and Jaco van de Pol for the discussions we had about the rst question. They helped me to acquire an opinion on the subject. Furthermore, acknowledgements are due to Jan Willem Klop for explaining to me some things about Term Rewriting and stimulating me to investigate simulation relations. Finally, I thank my friends of the Faculty and Anna for support in various ways.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Knowledge-based System Techniques in the Protocol Design Process

This paper describes the knowledge-based system techniques, such as program transformation and artificial intelligence techniques, used to design a reliable protocol. Program transformation techniques can be used in deriving protocol specifications. AI techniques, such as search algorithms and theorem proving, can be used to reduce the global space search. AI techniques can also be used to help...

متن کامل

On the Correctness of the Factoring Transformation

Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. Recently we analyzed a program transformation, called factoring transformation [4], that may save both execution time and memory occupation in a non-deterministic computation. In this paper we study the formal properties of our transformation, proving its co...

متن کامل

Proving the Correctness of Recursion-Based Automatic Program Transformations

This paper shows how the Improvement Theorem|a semantic condition for the total correctness of program transformation on higher-order functional programs|has practical value in proving the correctness of automatic techniques, including deforestation and supercompilation. This is aided by a novel formulation (and generalisation) of deforestation-like transformations, which also greatly adds to t...

متن کامل

Proving Correctness of Transformation Functions in Real-Time Groupware

Operational transformation is an approach which allows to build real-time groupware tools. This approach requires correct transformation functions. Proving the correction of these transformation functions is very complex and error prone. In this paper, we show how a theorem prover can address this serious bottleneck. To validate our approach, we have verified the correctness of state-of-art tra...

متن کامل

Proving Correctness of Transformation Functions Functions in Real-Time Groupware

Operational transformation is an approach which allows to build real-time groupware tools. This approach requires correct transformation functions. Proving the correction of these transformation functions is very complex and error prone. In this paper, we show how a theorem prover can address this serious bottleneck. To validate our approach, we have verified the correctness of state-of-art tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996